منابع مشابه
A local criterion for Tverberg graphs
The topological Tverberg theorem states that for any prime power q and continuous map from a (d+ 1)(q− 1)-simplex to Rd, there are q disjoint faces Fi of the simplex whose images intersect. It is possible to put conditions on which pairs of vertices of the simplex that are allowed to be in the same face Fi. A graph with the same vertex set as the simplex, and with two vertices adjacent if they ...
متن کاملTverberg graphs
The topological Tverberg theorem states that for any prime power q and continuous map from a (d + 1)(q − 1)-simplex to R, there are q disjoint faces Fi of the simplex whose images intersect. It is possible to put conditions on which pairs of vertices of the simplex that are allowed to be in the same face Fi. A graph with the same vertex set as the simplex, and with two vertices adjacent if they...
متن کاملLocal stability criterion for self-gravitating disks in modified gravity
We study local stability of self-gravitating fluid and stellar disk in the context of modified gravity theories which predict a Yukawa-like term in the gravitational potential of a point mass. We investigate the effect of such a Yukawa-like term on the dynamics of self-gravitating disks. More specifically, we investigate the consequences of the presence of this term for the local stability of t...
متن کاملA planarity criterion for cubic bipartite graphs
We prove that a simple finite bipartite cubic non-planar graph contains a clean subdivision of K3.3. Here a subdivision of K3,3 is defined 1o be clean if it can be obtained from K3,3 by subdividing any edge by an even number of vertices. The proof is constructive and gives rise to a polynomial-time algorithm. @ 1998 Elsevier Science B.V. All rights reserved
متن کاملIsomorphism criterion for monomial graphs
Let q be a prime power, Fq be the field of q elements, and k;m be positive integers. A bipartite graph G 1⁄4 Gqðk;mÞ is defined as follows. The vertex set of G is a union of two copies P and L of two-dimensional vector spaces over Fq, with two vertices ðp1;p2Þ 2 P and 1⁄2 l1; l2 2 L being adjacent if and only if p2 þ l2 1⁄4 p 1 l 1 . We prove that graphs Gqðk ;mÞ and Gq0 ðk 0;m0Þ are isomorphic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 2011
ISSN: 0209-9683,1439-6912
DOI: 10.1007/s00493-011-2665-9